Rate distortion optimal signal compression using second order polynomial approximation
نویسندگان
چکیده
In this paper we present a time domain signal compression algorithm based on the coding of line segments which are used to approximate the signal. These segments are fit in a way that is optimal in the rate distortion sense. The approach is applicable to many types of signals, but in this paper we focus on the compression of ElectroCardioGram (ECG) signals. As opposed to traditional time-domain algorithms, where heuristics are used to extract representative signal samples from the original signal, an optimization algorithm is formulated in [1, 2, 3] for sample selection using graph theory, with linear interpolation applied to the reconstruction of the signal. In this paper the algorithm in [1, 2, 3] is generalized by using second order polynomial interpolation for the reconstruction of the signal from the extracted signal samples. The polynomials are fitted in a way that guarantees minimum reconstruction error given an upper bound on the number of bits. The method achieves good performance compared both to the case where linear interpolation is used in reconstruction of the signal and to other state-of-the-art ECG coders.
منابع مشابه
Compressing Piecewise Smooth Multidimensional Functions Using Surflets: Rate-Distortion Analysis
Discontinuities in data often represent the key information of interest. Efficient representations for such discontinuities are important for many signal processing applications, including compression, but standard Fourier and wavelet representations fail to efficiently capture the structure of the discontinuities. These issues have been most notable in image processing, where progress has been...
متن کاملPlanelet Transform: A New Geometrical Wavelet for Compression of Kinect-like Depth Images
With the advent of cheap indoor RGB-D sensors, proper representation of piecewise planar depth images is crucial toward an effective compression method. Although there exist geometrical wavelets for optimal representation of piecewise constant and piecewise linear images (i.e. wedgelets and platelets), an adaptation to piecewise linear fractional functions which correspond to depth variation ov...
متن کاملRate-distortion Optimized Geometrical Image Processing
Since geometrical features, like edges, represent one of the most important perceptual information in an image, efficient exploitation of such geometrical information is a key ingredient of many image processing tasks, including compression, denoising and feature extraction. Therefore, the challenge for the image processing community is to design efficient geometrical schemes which can capture ...
متن کاملOptimal Piecewise Linear Image Coding
Piecewise linear (PL) image coding proceeds in three steps: 1. A digital image is converted into a 1D-signal using a scanning procedure, for example by scanning lines in a zigzag or Hilbert order. 2. The signal is approximated by the graph of a piecewise linear function, which consists of a nite number of connected line segments. 3. Entropy encoding of the sequence of the segment end points. In...
متن کاملApproximation and Compression of Piecewise Smooth Functions
Wavelet or subband coding has been quite successful in compression applications, and this success can be attributed in part to the good approximation properties of wavelets. In this paper, we revisit rate-distortion bounds for wavelet approximation of piecewise smooth functions, in particular the piecewise polynomial case. We contrast these results with rate-distortion bounds achievable using a...
متن کامل